Minimal Conditions for Additive Conjoint Measurement and Qualitative Probability1

نویسنده

  • LOUIS NARENS
چکیده

At the present time, there is one set of techniques for proving representation theorems for finite measurement structures an another set for infinite structures. Techniques for finite structures were developed in Scott (1964) and basically consist of solving finite sets of inequalities; techniques for infinite structures in one way or another resemble those used in Holder (1901) an d consist of the construction of fundamental sequences. Although finite structures often admit good axiomatizations in the sense that necessary and sufficient conditions for their representations can be given, they do not admit good uniqueness results. Infinite structures, however, often have uniqueness results for their representations but assume structural (nonnecessary) conditions in their axiomatizations. In this paper, new techniques are developed which allow infinite structures to be represented in terms of their finite substructures and thus simultaneously achieve good axiomatizations and representation theorems. These new techniques use the compactness theorem of mathematical logic in a way similar to Abraham Robinson’s use in his Nomtandurd Analysis (Robinson, 1966). However, to avoid the introduction of a large amount of mathematical logic into this paper, algebraic constructions are given for the various uses of the compactness theorem. This makes the paper relatively self-contained. These new techniques also allow a bridge to be built from finite to infinite structures. Thus, in Section 7 it is shown that certain infinite structures with unique representations are limits of sequences of finite structures. In terms of representations this means that as more elements are included into the qualitative structure the more “unique” the representation becomes. These new techniques also avoid the use of Archimedean axioms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nontransitive Decomposable Conjoint Measurement 1

Traditional models of conjoint measurement look for an additive representation of transitive preferences. They have been generalized in two directions. Nontransitive additive conjoint measurement models allow for nontransitive preferences while retaining the additivity feature of traditional models. Decomposable conjoint measurement models are transitive but replace additivity by a mere decompo...

متن کامل

Ordered categories and additive conjoint measurement on connected sets

Suppose that a binary relation is given on a n-fold Cartesian product. The study of the conditions guaranteeing the existence of n value functions such that the binary relation can be additively represented is known as additive conjoint measurement. In this paper we analyze a related problem: given a partition of a Cartesian product into r ordered categories, what conditions do ensure the repre...

متن کامل

‘ Additive difference ’ models without additivity and subtractivity 1 D . Bouyssou

This paper studies conjoint measurement models tolerating intransitivities that closely resemble Tversky’s additive difference model while replacing additivity and subtractivity by mere decomposability requirements. We offer a complete axiomatic characterization of these models without having recourse to unnecessary structural assumptions on the set of objects. This shows the pure consequences ...

متن کامل

‘Additive difference’ models without additivity and subtractivity

This paper studies conjoint measurement models tolerating intransitivities that closely resemble Tversky’s additive difference model while replacing additivity and subtractivity by mere decomposability requirements. We offer a complete axiomatic characterization of these models without having recourse to unnecessary structural assumptions on the set of objects. This shows the pure consequences ...

متن کامل

On the Order–completion of Additive Conjoint Structures

Measurement theory provides additive conjoint structures for additive representations of empirical data. Roughly, an additive conjoint structure is a product of (quasi)ordered sets with some properties connecting the different factors of the product. Well-known Debreu’s Theorem says that every additive conjoint structure can be embedded in a vector space over the real numbers. This embedding yi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003